我们研究了如何修改可执行文件以欺骗恶意软件分类系统。这项工作的主要贡献是一种方法，可以随机注入恶意软件文件，并将其用作攻击以降低分类准确性，也可以作为防御方法，从而增加可用于培训的数据。它尊重操作系统文件格式，以确保在注射后仍将执行恶意软件，并且不会改变其行为。我们重现了五种最先进的恶意软件分类方法来评估我们的注射方案：一种基于GIST+KNN，三个CNN变体和一种封闭式CNN。我们在公共数据集上进行了实验，其中有25个不同家庭的9,339个恶意软件样本。我们的结果表明，恶意软件的大小增加了7％，导致恶意软件家庭分类的准确度下降了25％至40％。他们表明，自动恶意软件分类系统可能不像文献中最初报道的那样值得信赖。我们还使用修改后的麦芽脂肪剂以及原始恶核评估，以提高网络的鲁棒性，以防止上述攻击。结果表明，重新排序恶意软件部分和注入随机数据的组合可以改善分类的整体性能。代码可在https://github.com/adeilsonsilva/malware-injection中找到。

点云过滤和正常估计是3D场中的两个基本研究问题。现有方法通常会单独执行正常的估计和过滤，并且经常表现出对噪声和/或无法保留尖锐几何特征（例如角和边缘）的敏感性。在本文中，我们提出了一种新颖的深度学习方法，以共同估计正态和过滤点云。我们首先引入了一个基于3D补丁的对比学习框架，并以噪声损坏为增强，以训练能够生成点云斑块的忠实表示的功能编码器，同时保持噪音的强大功能。这些表示由简单的回归网络消耗，并通过新的关节损失进行监督，同时估算用于过滤贴片中心的点正常和位移。实验结果表明，我们的方法同时支持这两个任务，并保留尖锐的功能和细节。通常，它在这两个任务上都胜过最先进的技术。

Traditionally, data analysis and theory have been viewed as separate disciplines, each feeding into fundamentally different types of models. Modern deep learning technology is beginning to unify these two disciplines and will produce a new class of predictively powerful space weather models that combine the physical insights gained by data and theory. We call on NASA to invest in the research and infrastructure necessary for the heliophysics' community to take advantage of these advances.

The field of robotics, and more especially humanoid robotics, has several established competitions with research oriented goals in mind. Challenging the robots in a handful of tasks, these competitions provide a way to gauge the state of the art in robotic design, as well as an indicator for how far we are from reaching human performance. The most notable competitions are RoboCup, which has the long-term goal of competing against a real human team in 2050, and the FIRA HuroCup league, in which humanoid robots have to perform tasks based on actual Olympic events. Having robots compete against humans under the same rules is a challenging goal, and, we believe that it is in the sport of archery that humanoid robots have the most potential to achieve it in the near future. In this work, we perform a first step in this direction. We present a humanoid robot that is capable of gripping, drawing and shooting a recurve bow at a target 10 meters away with considerable accuracy. Additionally, we show that it is also capable of shooting distances of over 50 meters.

Automatic Text Summarization (ATS) is becoming relevant with the growth of textual data; however, with the popularization of public large-scale datasets, some recent machine learning approaches have focused on dense models and architectures that, despite producing notable results, usually turn out in models difficult to interpret. Given the challenge behind interpretable learning-based text summarization and the importance it may have for evolving the current state of the ATS field, this work studies the application of two modern Generalized Additive Models with interactions, namely Explainable Boosting Machine and GAMI-Net, to the extractive summarization problem based on linguistic features and binary classification.

Federated learning (FL) has emerged as an instance of distributed machine learning paradigm that avoids the transmission of data generated on the users' side. Although data are not transmitted, edge devices have to deal with limited communication bandwidths, data heterogeneity, and straggler effects due to the limited computational resources of users' devices. A prominent approach to overcome such difficulties is FedADMM, which is based on the classical two-operator consensus alternating direction method of multipliers (ADMM). The common assumption of FL algorithms, including FedADMM, is that they learn a global model using data only on the users' side and not on the edge server. However, in edge learning, the server is expected to be near the base station and have direct access to rich datasets. In this paper, we argue that leveraging the rich data on the edge server is much more beneficial than utilizing only user datasets. Specifically, we show that the mere application of FL with an additional virtual user node representing the data on the edge server is inefficient. We propose FedTOP-ADMM, which generalizes FedADMM and is based on a three-operator ADMM-type technique that exploits a smooth cost function on the edge server to learn a global model parallel to the edge devices. Our numerical experiments indicate that FedTOP-ADMM has substantial gain up to 33\% in communication efficiency to reach a desired test accuracy with respect to FedADMM, including a virtual user on the edge server.

随着深层技术的传播，这项技术变得非常易于访问和足够好，以至于对其恶意使用感到担忧。面对这个问题，检测锻造面孔对于确保安全和避免在全球和私人规模上避免社会政治问题至关重要。本文提出了一种使用卷积神经网络检测深击的解决方案，并为此目的开发了一个数据集-celeb -df。结果表明，在这些图像的分类中，总体准确性为95％，提出的模型接近于最新的现状，并且可以调整未来出现的操纵技术的可能性。。

由于促进了各种复杂的任务，因此异质自动机器人团队变得越来越重要。对于此类异质机器人，目前尚无一致的方法来描述每个机器人提供的功能。在制造领域，功能建模被认为是针对不同机器提供的语义模型功能的一种有希望的方法。这项贡献研究了如何将能力模型从制造应用到自主机器人领域，并提出了这种能力模型的方法。

作业车间时间表问题（JSSP）是指代理分配应在群集中在计算机中指定时间执行的任务的能力。可以从几种方法中实现任务分配，但是，该报告探讨了蚂蚁菌落优化为多种JSSP实例生成可行解决方案的能力。该建议将JSSP模拟为完整的图形，因为分离模型可以防止ACO探索所有搜索空间。JSSP的几个实例用于评估该提案。结果表明，该算法可以达到最佳解决方案，以便使用一系列参数来轻松更难实例。

由于死亡率，搬迁，费率和重建决策，自然灾害可能会在世界范围内引起实质性的负面社会经济影响。在发生自然危害期间，机器人技术已成功地用于识别和营救受害者。但是，在部署解决方案方面几乎没有努力在这些解决方案中可以自己搬迁公民的生命，而无需等待由人类组成的救援团队。强化学习方法可用于部署这种解决方案，但是，部署它的最著名算法之一，Q学习，在执行其学习例程时会产生偏见的结果。在这项研究中，采用了基于可观察到的马尔可夫决策过程的公民搬迁解决方案，在此，根据基于网格世界的拟议危害模拟引擎，评估了双Q学习在自然危害期间搬迁公民的能力。该解决方案的性能是作为公民搬迁程序的成功率测量的，结果表明该技术将其描绘成超过100％的性能，以实现简单的方案，而硬性方面的性能接近50％。